Optimal Call Admission Control in Generalized Processor Sharing (GPS) Schedulers
نویسندگان
چکیده
Generalized Processor Sharing(GPS) is an idealized fluid discipline with a number of desirable properties. Its packetized version PGPS is considered to be a good choice as a packet scheduling discipline to guarantee Quality-of-Service in IP and ATM networks. The existing Connection Admission Control(CAC) frameworks for GPS result in a conservative resource allocation. We propose an Optimal CAC algorithm for a GPS scheduler, for leaky-bucket constrained connections with deterministic delay guarantees. Our numerical results show that the Optimal CAC results in a higher network utilization than the existing CACs. Keywords—Generalized Processor Sharing, Call Admission Control, Optimal Bandwidth Allocation, Non-Rate Proportional Resource Allocation.
منابع مشابه
Call Admission Control in Generalized Processor Sharing (GPS) Schedulers Using Non-Rate Proportional Weighting of Sessions
Generalized Processor Sharing (GPS) is an ideal fluid scheduling discipline that supports well defined delay and loss bounds on Leakybucket constrained traffic. Its packetized versions (WFQ, WF2Q, PGPS etc...) are considered as the packet scheduler of choice in IP routers and ATM switches of the future. The currently accepted approach for the design of GPS schedulers is based on deterministic Q...
متن کاملCall Admission Control Schemes under the Generalized Processor Sharing Scheduling
Provision of Quality-of-Service (QoS) guarantees is an important and challenging problem in the design of integrated-services packet networks. Call admission control is an integral part of the challenge and is closely related to other aspects of networks such as service models, scheduling disciplines, traffic characterization and QoS specification. In this paper we provide a theoretical framewo...
متن کاملCall admission control schemes under generalized processor sharing scheduling
Provision of Quality-of-Service (QoS) guarantees is an important and challenging issue in the design of integrated-services packet networks. Call admission control is an integral part of the challenge and is closely related to other aspects of networks such as service models, scheduling disciplines, traffic characterization and QoS specification. In this paper we provide a theoretical framework...
متن کاملLarge Deviations and the Generalized Processor Sharing Scheduling for a Two-Queue System
We establish the optimal asymptotic decay rate of per-session queue length tail distributions for a two-queue system where a single constant rate server serves the two queues using the Generalized Processor Sharing (GPS) scheduling discipline. The result is obtained using the sample-path large deviation principle and has implications in call admission control for high-speed communication networks.
متن کاملLarge deviations and the generalized processor sharing scheduling for a multiple-queue system
We establish asymptotic upper and lower bounds on the asymptotic decay rate of per-session queue length tail distributions for a multiple-queue system where a single constant rate server services the queues using the generalized processor sharing (GPS) scheduling discipline. As an indication of the tightness of the bounds, in the special case where there are only two queues, the upper and lower...
متن کامل